Maximum Entropy Method for Subnetwork Origin–Destination Trip Matrix Estimation

A maximum entropy-least squares estimator for elastic origin- destination trip matrix estimation

It is well known that the origin-destination (O-D) flow table of a subnetwork is not only determined by trip generation and distribution, but also by traffic routing and diversion, due to the existence of internal-external, external-internal and externalexternal flows. This result indicates the variable nature of subnetwork O-D flows. This paper discusses an elastic O-D flow table estimation pr...

Generalized maximum entropy estimation

We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming, we present a novel approximation scheme using a smoothed fast gradient method that is equipped with explicit bounds on the approximation error. We further demonstrate how the prese...

Maximum Entropy Method for Composition Vector Method

Maximum Entropy Estimation for Survey sampling

Calibration methods have been widely studied in survey sampling over the last decades. Viewing calibration as an inverse problem, we extend the calibration technique by using a maximum entropy method. Finding the optimal weights is achieved by considering random weights and looking for a discrete distribution which maximizes an entropy under the calibration constraint. This method points a new ...

Towards algebraic methods for maximum entropy estimation

We show that various formulations (e.g., dual and Kullback-Csiszar iterations) of estimation of maximum entropy (ME) models can be transformed to solving systems of polynomial equations in several variables for which one can use celebrated Gröbner bases methods. Posing of ME estimation as solving polynomial equations is possible, in the cases where feature functions (sufficient statistic) that ...